// This file contains the weighted network of coappearances of characters in
// Victor Hugo's novel "Les Miserables". Nodes represent characters as indicated
// by the labels, and edges connect any pair of characters that appear in the
// same chapter of the book. The values on the edges are the number of such
// coappearances. The data on coappearances were taken from D. E. Knuth, The
// Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley,
// Reading, MA (1993).
//
// The group labels were transcribed from "Finding and evaluating community
// structure in networks" by M. E. J. Newman and M. Girvan.

var miserables = {
  nodes:[
    //10 links
    {name:"Pham Van Thanh", id:2, group:0},
    {name:"Nguyen Hoai Xuan", id:2, group:1},
    {name:"Nguyen Thi Thanh Thu", id:2, group:1},
    {name:"Nguyen Thi My Le", id:2, group:1},
    {name:"Tang Thi Kieu Mi", id:2, group:1},
    {name:"Vu Thi Lan Anh", id:2, group:1},
    {name:"Xuan's Friends", id:2, group:2},
    {name:"Le's Friends", id:2, group:2},
    {name:"Other Users", id:2, group:3},
  ],
  links:[
  //1: node thu 2 tu tren xuong
    {source:1, target:0, value:20},
    {source:2, target:0, value:20},
    {source:3, target:0, value:20},
    {source:4, target:0, value:20},
    {source:5, target:0, value:20},
    {source:6, target:1, value:5},
    {source:7, target:3, value:5},
    {source:8, target:0, value:20},
  ]
};
